Integrated Scheduling of Production and Distribution with Release Dates and Capacitated Deliveries

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Integrated production and distribution scheduling

Contents List of Figures vi List of Algorithms vii 1 Introduction 1 1.

متن کامل

Integrated capacitated transportation and production scheduling problem in a fuzzy environment

Nowadays, several methods in production management mainly focus on the different partners of supply chain management. In real world, the capacity of planes is limited. In addition, the recent decade has seen the rapid development of controlling the uncertainty in the production scheduling configurations along with proposing novel solution approaches. This paper proposes a new mathematical model...

متن کامل

Scheduling with Uncertain Release Dates

The aim of the paper is to examine whether we can adapt Bent and van Hentenryck’s combination methods to our problem, and to determine how effective and significant the methods are. In particular, we develop four ways of applying Bent and Van Hentenryck’s consensus approach[3] to our problem. In addition, since we assume the uncertainty distribution is known, we propose a probabilistic sampling...

متن کامل

Integrated production and distribution scheduling problems related with fixed delivery departure dates and number of late orders

*Correspondence: [email protected] Department of Mathematics, Taizhou University, Taizhou, Zhejiang 317000, P.R. China Abstract We consider an integrated production and distribution scheduling problem faced by a typical make-to-order manufacturer which relies on a third-party logistics provider for finished product delivery to customers. In the beginning of a planning horizon, the manufac...

متن کامل

Single Machine Scheduling with Release Dates

We consider the scheduling problem of minimizing the average weighted completion time of n jobs with release dates on a single machine. We first study two linear programming relaxations of the problem, one based on a time-indexed formulation, the other on a completiontime formulation. We show their equivalence by proving that a O(n logn) greedy algorithm leads to optimal solutions to both relax...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematical Problems in Engineering

سال: 2016

ISSN: 1024-123X,1563-5147

DOI: 10.1155/2016/9315197